In Proceedings of the First IEEE IPPS Workshop on Parallel and Distributed Real - Time Systems , Newport Beach , CA , April 1993 . AIDA
نویسنده
چکیده
In this paper, we propose a superior technique for distributed time-critical communication using AIDA, a novel elaboration on Michael O. Rabin's IDA A 1 9 ]. We s h o w that using a small dynamically-controlled amount of redundancy, stringent timing constraints imposed on periodic as well as sporadic communication requests in a distributed real-time system can be fulllled up to any degree of conndence. AIDA i s randomized in the sense that it does not guarantee the fullllment of hard time constraints. Instead, it guarantees a lower bound on the probability of fulllling such constraints. We contrast AIDA with traditional communication scheduling techniques used in conjunction with time-critical applications in general, and distributed multimedia systems in particular. The suitability o f A I D A-based bandwidth allocation for a variety of time-critical applications is established and plans for future research experiments are mentioned.
منابع مشابه
Combination Surgical Excision and Fractional Carbon Dioxide Laser for Treatment of Rhinophyma
Rhinophyma is a severe late complication of rosacea, which is characterized by progressive hyperplasia of sebaceous glands and connective tissue involving the lower two-thirds of the nose. It can be an emotionally devastating disorder, and serve as a medium for occult cancers and other health problems. Many surgical treatments have been advocated, as well as dermabrasion and laser therapy. In l...
متن کامل14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2011, Newport Beach, California, USA, 28-31 March 2011
متن کامل
Optimal task scheduling at run time to exploit intra-tile parallelism
In this paper we address the issue of iteration space tiling to minimize the completion time of loops when executed on multicomputers. The previous work on tiling assumes atomic execution of tiles to minimize synchronization costs. In this work, we remove the restriction of atomicity of tiles so that internal parallelism within tiles is exploited by overlapping computation with communication on...
متن کاملIntroduction to the 10th international workshop on JavaTM and components for parallelism, distribution and concurrency
This series of workshops was born at IPPS’98 that was held in Orlando, Florida, in April 1998, where it appeared that Java was becoming more and more important for the IPPS/SPDP community, i.e. for parallel and distributed computing. Many of the papers that were presented in Orlando referred to Java. Furthermore the attendance of the tutorial on Parallel and Distributed Computing Using Java tha...
متن کاملIn Proceedings of the First IEEE Workshop on Real - Time Applications , New York , NY , May 1993 . Probabilistic Job Scheduling for Distributed Real - time
We describe a heuristic for dynamically scheduling time-constrained tasks in a distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success. Nodes in the system inform each other about their st...
متن کامل